From χ- to χ-bounded classes

نویسندگان

چکیده

χ-bounded classes are studied here in the context of star colorings and, more generally, χp-colorings. This fits to a general scheme sparsity and leads natural extensions notion bounded expansion class. In this paper we solve two conjectures related coloring (i.e. χ2) boundedness. One is disproved fact determine which weakening holds true. χp-boundedness stability give structural characterizations (strong weak) χp-bounded classes. We also generalize result Wood relating chromatic number graph its 1-subdivision. As an application our characterizations, among other things, show that for every odd integer g>3 even hole-free graphs G contain at most φ(g,ω(G))|G| holes length g.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Workshop on χ-bounded classes

Schedule Thursday 09:30 Welcome coffee. 10:00 S. Thomassé. Introduction. 10:30 J. Fox. A disproof of Scott’s conjecture. 11:30 Lunch break. 14:00 P. Ossona de Mendez. Low tree-depth decompositions and homomorphism bounds. 15:00 Open problems session. Friday 9:00 P. Seymour. Structure theory for tournaments. 10:00 J. Fox. Graph regularity lemmas. 11:00 A. Scott. T.B.A. 12:00 Lunch break. 14:00 V...

متن کامل

On (δ, χ)-Bounded Families of Graphs

A family F of graphs is said to be (δ, χ)-bounded if there exists a function f(x) satisfying f(x) → ∞ as x → ∞, such that for any graph G from the family, one has f(δ(G)) ≤ χ(G), where δ(G) and χ(G) denotes the minimum degree and chromatic number of G, respectively. Also for any set {H1,H2, . . . ,Hk} of graphs by Forb(H1,H2, . . . ,Hk) we mean the class of graphs that contain no Hi as an induc...

متن کامل

$χ$-bounded Families of Oriented Graphs

A famous conjecture of Gyárfás and Sumner states for any tree T and integer k, if the chromatic number of a graph is large enough, either the graph contains a clique of size k or it contains T as an induced subgraph. We discuss some results and open problems about extensions of this conjecture to oriented graphs. We conjecture that for every oriented star S and integer k, if the chromatic numbe...

متن کامل

Implementing χ

Calculi are used to reason about functional languages from a theoretical perspective. They allows us to make bold statements about programs based on sound and correct deductive methods. Methods of visualization allow us to gain a better understanding of the communication and interaction involved between processes. Often, graphs are used because of the level of intuition they can bring to a syst...

متن کامل

Amalgams and χ-Boundedness

A class of graphs is hereditary if it is closed under isomorphism and induced subgraphs. A class G of graphs is χ-bounded if there exists a function f : N → N such that for all graphs G ∈ G, and all induced subgraphs H of G, we have that χ(H) ≤ f(ω(H)). We prove that proper homogeneous sets, clique-cutsets, and amalgams together preserve χ-boundedness. More precisely, we show that if G and G∗ a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 2023

ISSN: ['0095-8956', '1096-0902']

DOI: https://doi.org/10.1016/j.jctb.2021.05.006